A Distributed Real Time Path Restoration Protocol with Performance close to Centralized Multi-commodity Max Flow
نویسندگان
چکیده
Intense competition between transport network service providers and the widespread deployment of vulnerable high-capacity fiber optic transport facilities has created the need for networks with short restoration times. This paper presents an optimized distributed real time path restoration mechanism, named OPRA, capable of restoring network failures quickly with performance close to centralized multi-commodity max-flow. OPRA synthesizes restoration pathsets by autonomous, database-free, self-organizing interaction between nodes. Simulation results predict that OPRA will restore network failures in very minimally redundant networks in less than two seconds.
منابع مشابه
Early Experiences in Traffic Engineering Exploiting Path Diversity: A Practical Approach
Recent literature has proved that stable dynamic routing algorithms have solid theoretical foundation that makes them suitable to be implemented in a real protocol, and used in practice in many different operational network contexts. Such algorithms inherit much of the properties of congestion controllers implementing one of the possible combination of AQM/ECN schemes at nodes and flow control ...
متن کاملFinding the Optimal Path to Restoration Loads of Power Distribution Network by Hybrid GA-BCO Algorithms Under Fault and Fuzzy Objective Functions with Load Variations
In this paper proposes a fuzzy multi-objective hybrid Genetic and Bee colony optimization algorithm(GA-BCO) to find the optimal restoration of loads of power distribution network under fault.Restoration of distribution systems is a complex combinatorial optimization problem that should beefficiently restored in reasonable time. To improve the efficiency of restoration and facilitate theactivity...
متن کاملRoutage distribué et adaptatif fondé sur la théorie des jeux
A common challenge in current and future communication networks is to exploit path diversity to increase performance and reliability. This problem can be modeled as a multi-commodity flow problem [1]. Given a number of concurrent source-destination flows, the problem is to assign these flows to network paths, while respecting capacity constraints and optimizing a performance metric. Our goal is...
متن کامل7.1 Multicut
P∈Pi P∋e fi,P ≤ ce ∀e fi,P ≥ 0 Dual 1 solves the max-sum multi-commodity flow problem: ce represents the capacity of an edge, and fi,P is the amount of flow directed from si to ti along the path P . The LP tries to maximize the total amount of commodity flow. Lemma 17.1.1 Multicut is always larger than the corresponding max-sum multi-commodity flow. Lemma 17.1.2 Multicut is at most O(logK) time...
متن کاملPerformance Analysis of Restoration Schemes in Survivable WDM Mesh Networks
Recent development in optical networking employing wavelength-division-multiplexing (WDM) fulfills the high bandwidth demand applications. Failure of such networks, leads to enormous data and revenue loss. Design a low cost survivable WDM network is always an interesting and difficult process. In this paper we present link-path model for capacity allocation and calculate blocking probability in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998